/an Experiment in Approval Voting

نویسندگان

  • Peter C. Fishburn
  • John D. C. Little
چکیده

In its 1985 election for council The Institute of Management Sciences (TIMS) ran a test of approval voting by sending a non-binding approval ballot to its members along with the regular plurality ballot. In approval voting a person votes for (approves of) as many candidates as desired, the winner being the candidate with the most votes. Two of the TIMS contests had three candidates for a single office and a third had five candidates for two offices. In such situations approval voting can produce winners who are more generally acceptable to the electorate than standard plurality voting. This is because the approval mechanism tends to prevent two candidates with broad appeal from splitting a majority constituency and electing a minority candidate. Of these three TIMS contests two would have had different winners had approval voting been binding. In the first election with candidates A, B, and C, C narrowly beat B in the regular election, but B was the approval winner because considerably more of A's supporters approved of B than C. In the second election approval and plurality voting agreed on the winner. In the third election with two positions to be filled from a field of five candidates. A, B, C, D, and E, B was a winner by either method, but the official second winner. A, placed fourth in the approval vote behind C and D. Close examination of ranking data shows that in the first election a head to head contest between B and C would be a toss up. Nevertheless, because of secondary support, B is a better choice by the criterion of broad acceptance by the electorate. In the third election C and D are similarly close but either would have broader support than the plurality choice A and of the two C has somewhat broader general approval. It should be pointed out that, as approval voting creates new winners, it must also create new losers. A minority constituency has more difficulty taking advantage of a majority split to install their candidate. The TIMS experiment demonstrated remarkably well the points made by the proponents of approval voting, namely, that it is a simple and effective way to do a better job than plurality voting at selecting the candidates who have the broadest base of support among the electorate.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple votes, ballot truncation and the two-party system: an experiment

Countries that elect their policy-makers by means of Plurality Voting tend to have a two-party system. We conduct laboratory experiments to study whether alternative voting procedures yield a two-party system as well. Plurality Voting is compared with Approval Voting and Dual Voting, both of which allow voters to vote for multiple candidates, but differ in whether voters are required to cast al...

متن کامل

Sophisticated approval voting, ignorance priors, and plurality heuristics: a behavioral social choice analysis in a Thurstonian framework.

This project reconciles historically distinct paradigms at the interface between individual and social choice theory, as well as between rational and behavioral decision theory. The authors combine a utility-maximizing prescriptive rule for sophisticated approval voting with the ignorance prior heuristic from behavioral decision research and two types of plurality heuristics to model approval v...

متن کامل

Sur les aspects computationnels du vote par approbation. (Computational Aspects of Approval Voting)

The subject of this thesis is the study of computational aspects of approval voting. Mostof the works are theoretical results about computational issues raised by approval voting, in manydi erent settings. Indeed, I use algorithmic techniques like polynomial reductions to prove that manyproblems are di cult to solve in the context of approval voting. However, I also study some quest...

متن کامل

On the Manipulability of Votes: The Case of Approval Voting

The famous result of Gibbard and Satterthwaite shows that every voting procedure is manipulable if the voters can have any preferences over the candidates. That is, a voter may improve the voting result by not voting according to his true preference. Approval voting, introduced by Brams and Fishburn, is not manipulable if preferences are dichotomous: each voter only distinguishes between accept...

متن کامل

Computational Aspects of Multi-Winner Approval Voting

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of the rules are strategyproof, even for d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008